Efficient Implementation of Correlation Matrix Memories on SN0 based ccNUMA Parallel Computers
نویسنده
چکیده
Correlation Matrix Memory (CMM) is a single layer binary neural network. One of the principle motivations behind the development of binary neural networks was the ease of implementation. Almost all of todays computing machines operate using binary instructions on binary data and therefore lend themselves well to the simulation of binary networks. However as new, more complex, applications are found for neural networks the size of CMM required the amount of data they operate on can grow very fast. This project looks at methods for fast, efficient and scalable simulation of large CMMs on ccNUMA (cache-coherent non-uniform memory access) machines, and in particular, on on SGI Origin servers. The primary goal being to generate a highly efficient and practical set of algorithms for such simulation. Within this project algorithms for both sequential and concurrent execution are devised and analysed in detail. Different method of concurrency are suggested and results of experiments, carried out on real systems, are presented.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملOn the evaluation of matrix polynomials using several GPGPUs
Computing a matrix polynomial is the basic process in the calculation of functions of matrices by the Taylor method. One of the most efficient techniques for computing matrix polynomials is based on the Paterson– Stockmeyer method. Inspired by this method, we propose in this work a recursive algorithm and an efficient implementation that exploit the heterogeneous nature of current computers to ...
متن کاملDisk Resident Arrays: An Array-Oriented I/O Library for Out-of-Core Computations
In out-of-core computations, disk storage is treated as another level in the memory hierarchy, below cache, local memory, and (in a parallel computer) remote memories. However, the tools used to manage this storage are typically quite different from those used to manage access to local and remote memory. This disparity complicates implementation of out-of-core algorithms and hinders portability...
متن کاملA task parallel implementation of an RBF-generated finite difference method for the shallow water equations on the sphere✩
Radial basis function-generated finite difference (RBF-FD) methods have recently been proposed as very interesting for global scale geophysical simulations, and have been shown to outperform established pseudo-spectral and discontinuous Galerkin methods for shallow water test problems. In order to be competitive for very large scale simulations, the implementation of the RBF-FD methods needs to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999